Simplification of expressions involving radicals
نویسندگان
چکیده
منابع مشابه
Automated and readable simplification of trigonometric expressions
Automated simplification of trigonometric expressions is an important problem that hasn’t been completely solved by current computer algebra systems. This paper presents a number of unique prescriptions for the ordering of some trigonometric transformation rules, which have been derived by observing how human experts follow their intuitive rules. We have implemented the procedure in Lisp becaus...
متن کاملRewrite Rules and Simplification of Matrix Expressions
This paper concerns the automated simplification of expressions which involve non-commuting variables. The technology has been applied to the simplification of matrix and operator theory expressions which arise in engineering applications. The non-commutative variant of the Gröbner Basis Algorithm is used to generate rewrite rules. We will also look at the phenomenon of infinite bases and impli...
متن کاملAutomated simplification of large symbolic expressions
We present a set of algorithms for automated simplification of constants of the form ∑ i αixi with αi rational and xi complex. The included algorithms, called SimplifySums and implemented in Mathematica, remove redundant terms, attempt to make terms and the full expression real, and remove terms using repeated application of the integer relation detection algorithm PSLQ. Also included are facil...
متن کاملSimplification of Symbolic-Numerical Interval Expressions∗
Although interval arithmetic is increasingly used in combination with computer algebra and other methods, both approaches — symbolic-algebraic and interval-arithmetic — are used separately. Implementing symbolic interval arithmetic seems not suitable due to the exponential growth in the “size” of the end-points. In this paper we propose a methodology for “true” symbolic-algebraic manipulations ...
متن کاملHEPGAME and the Simplification of Expressions
Advances in high energy physics have created the need to increase computational capacity. Project HEPGAME was composed to address this challenge. One of the issues is that numerical integration of expressions of current interest have millions of terms and takes weeks to compute. We have investigated ways to simplify these expressions, using Horner schemes and common subexpression elimination. O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1985
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(85)80014-6